Maximal Cohen–Macaulay modules over the cone of an elliptic curve
نویسندگان
چکیده
منابع مشابه
Maximal Cohen-Macaulay Modules over the Affine Cone of the Simple Node
A concrete description of all graded maximal Cohen–Macaulay modules of rank one and two over the non-isolated singularities of type y3 1 +y 2 1y3−y 2y3 is given. For this purpose we construct an alghoritm that provides extensions of MCM modules over an arbitrary hypersurface.
متن کاملPeriod Determinant of an Irregular Connection over an Elliptic Curve
In this article, we calculate the period of an irregular singular connection ∇ = d+dy on the legendre curve U : y = x(x−1)(x−λ). We calculate its de Rham cohomology and the cycles in the homology of the dual connection and describe the period matrix. Terasoma’s work is introduced to approximate the direct image connection π∗(∇) by a sequence of regular connections as an intermediate step where ...
متن کاملAn FPGA Implementation of an Elliptic Curve Processor over
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملHardware Implementation of an Elliptic Curve Processor over GF(p)
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC), i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2002
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(02)00052-2